Solving satisfiability problems with preferences
نویسندگان
چکیده
منابع مشابه
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previous papers, it has been shown that qualitative preferences on literals allow for capturing qualitative/quantitative preferences on literals/formulas; and that an optimal model for a satisfiability problems with qualita...
متن کاملSolving disjunctive temporal problems with preferences using maximum satisfiability
The Disjunctive Temporal Problem (DTP) involves conjunction of DTP constraints, each DTP constraint being a disjunction of difference constraints of the form x − y ≤ c, where x and y range over a domain of interpretation, and c is a numeric constant. The DTP is recognized to be an expressive framework for constraints modeling and processing. The addition of preferences, in the form of weights a...
متن کاملAlgorithms for Solving Satisfiability Problems with Qualitative Preferences
In this work we present a complete picture of our work on computing optimal solutions in satisfiability problems with qualitative preferences. With this task in mind, we first review our work on computing optimal solutions by imposing an ordering on the way the search space is explored, e.g., on the splitting heuristic in case the DPLL algorithm is used. The main feature of this approach is tha...
متن کاملSatisfiability and Preferences: Solving Optimization Problems with DLL
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different application domains, including planning and formal verification. The main reason for this success is that modern SAT solvers can successfully deal with problems having millions of variables. All these solvers are based on the D...
متن کاملSolving Random Satisfiability Problems with Quantum Computers
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average and variation of amplitudes among search states with the same costs. The analysis predicts good performance, on average, for a variety of problems including th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2010
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-010-9095-y